- sorting in ascending order
- сортировка по возрастанию
Англо-русский словарь по вычислительной технике и информационным технологиям - 4-е изд.. Сергей Орлов .
Англо-русский словарь по вычислительной технике и информационным технологиям - 4-е изд.. Сергей Орлов .
Sorting network — A sorting network is an abstract mathematical model of a network of wires and comparator modules that is used to sort a sequence of numbers. Each comparator connects two wires and sort the values by outputting the smaller value to one wire, and a … Wikipedia
Order by — An ORDER BY clause in SQL specifies that a SQL SELECT statement returns a result set with the rows being sorted by the values of one or more columns. The sort criteria do not have to be included in the result set. The sort criteria can be… … Wikipedia
ascending sort order — sorting order from smallest to largest or from A Z … English contemporary dictionary
Sorting — For the sorting of sediment, see Sorting (sediment). Sorting type Sorting is any process of arranging items in some sequence and/or in different sets, and accordingly, it has two common, yet distinct meanings: ordering: arranging items of the… … Wikipedia
Radix sort — In computer science, radix sort is a sorting algorithm that sorts integers by processing individual digits. Because integers can represent strings of characters (e.g., names or dates) and specially formatted floating point numbers, radix sort is… … Wikipedia
Collation — This article is about collation in library, information, and computer science. For other uses, see Collation (disambiguation). Alphabetical redirects here. For the type of writing system, see Alphabet. For the album, see Alphabetical (album). A–Z … Wikipedia
Windows Explorer — This article is about the Windows file system browser. For the similarly named web browser, see Internet Explorer Windows Explorer A component of Microsoft Windows Details Included with Microsoft Windows … Wikipedia
Batcher odd–even mergesort — Visualization of the odd–even mergesort network with eight inputs Batcher s odd–even mergesort is a generic construction devised by Ken Batcher for sorting networks of size O(n (log n)2) and depth O((log n)2), where n is the number … Wikipedia
Sort (C++) — sort is a function in C++ Standard Template Library that takes two random access iterators, the start and the end, as arguments and performs a comparison sort on the range of elements between the two iterators, front inclusive and end exclusive.… … Wikipedia
Multicriteria classification — In multiple criteria decision aiding (MCDA), multicriteria classification (or sorting) involves problems where a finite set of alternative actions should be assigned into a predefined set of preferentially ordered categories (classes).[1] For… … Wikipedia
COMPUTER SCIENCE — The term Computer Science encompasses three different types of research areas: computability, efficiency, and methodology. General Introduction Computability deals with the question of what is mechanically computable. The most natural way to… … Encyclopedia of Judaism